Stochastic Vehicle Routing Problem for Large-scale Emergencies
نویسندگان
چکیده
In this paper, we are interested in routing vehicles to service large-scale emergencies, such as natural disasters and terrorist attacks. We first analyze the characteristics of the routing problem for large-scale emergencies. We then survey the stochastic Vehicle Routing Problems (VRPs) and some variants of VRPs that are relevant to emergency response. We propose and discuss a mathematical formulation for this problem and a two-stage solution approach for it. Lastly, in an illustrative example of an anthrax terrorist attack, we demonstrate the effectiveness of our formulation in developing robust routes.
منابع مشابه
A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملThe Stochastic Vehicle Routing Problem for Large-scale Emergencies
In this paper, we are interested in routing vehicles to service large-scale emergencies, such as natural disasters and terrorist attacks. We describe the specifics of routing vehicles in a large-scale emergency and decompose the problem into two stages: a planning stage and an operational stage. In the planning stage, we aim to generate the routes well in advance of any emergencies; in the oper...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملThe Minimum Unmet Demand Stochastic Vehicle Routing Problem
In this paper, we are interested in routing vehicles to minimize unmet demand under uncertainty. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such as natural disasters or terroris...
متن کامل